منابع مشابه
Construction of DNA restriction maps based on a simplified experiment
MOTIVATION A formulation of a new problem of the restriction map construction based on a simplified digestion experiment and a development of an algorithm for solving both ideal and noisy data cases of the introduced problem. RESULTS A simplified partial digest problem and a branch and cut algorithm for finding the solution of the problem.
متن کاملSimplified Boardgames
We formalize Simplified Boardgames language, which describes a subclass of arbitrary board games. The language structure is based on the regular expressions, which makes the rules easily machine-processable while keeping the rules concise and fairly human-readable.
متن کاملa Simplified Model of Distributed Parameter Systems
A generalized simplified model for describing the dynamic behavior of distributed parameter systems is proposed. The various specific characteristics of gain and phase angle of distributed parameter systems are investigated from frequency response formulation and complex plane representation of the proposed simplified model. The complex plane investigation renders some important inequality cons...
متن کاملHeaps Simplified
The heap is a basic data structure used in a wide variety of applications, including shortest path and minimum spanning tree algorithms. In this paper we explore the design space of comparison-based, amortized-efficient heap implementations. From a consideration of dynamic single-elimination tournaments, we obtain the binomial queue, a classical heap implementation, in a simple and natural way....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1871
ISSN: 0028-0836,1476-4687
DOI: 10.1038/003447c0